Minimal state-space realization in linear system theory: An overview

نویسنده

  • B. De Schutter
چکیده

We give a survey of the results in connection with the minimal state space realization problem for linear time-invariant systems. We start with a brief historical overview and a short introduction to linear system theory. Next we present some of the basic algorithms for the reduction of non-minimal state space realizations and for the minimal state space realization of infinite or finite sequences of Markov parameters of linear time-invariant systems. Finally we discuss some extensions of this problem to other classes of systems and point out some related problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realization theory of discrete-time linear switched systems

The paper presents realization theory of discrete-time linear switched systems (abbreviated by DTLSSs). We present necessary and sufficient conditions for an input-output map to admit a discrete-time linear switched state-space realization. In addition, we present a characterization of minimality of discrete-time linear switched systems in terms of reachability and observability. Further, we pr...

متن کامل

Minimal realization in the max algebra is an extended linear complementarity problem

We demonstrate that the minimal state space realization problem in the max algebra can be transformed into an Extended Linear Complementarity Problem (ELCP). We use an algorithm that finds all solutions of an ELCP to find all equivalent minimal state space realizations of a single input single output (SISO) discrete event system. We also give a geometrical description of the set of all minimal ...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

Geometric Methods in Stochastic Realization and System Identiication

In this paper we discuss some recent advances in modeling and identiication of stationary processes. We point out that identiication of linear state-space models for stationary signals can be seen as stochastic realization of wide-sense stationary processes in an appropriate background Hilbert space. The geometric theory of stochastic realization developed in the last two decades plays an impor...

متن کامل

Subspace-based methods for the identification of linear time-invariant systems

An overview of subspace-based system identification methods is presented. Comparison between diferent algorithms are given and similarities pointed out. Abstract-Subspace-based methods for system identification have attracted much attention during the past few years. This interest is due to the ability of providing accurate state-space models for multivariable linear systems directly from input...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000